Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
نویسندگان
چکیده
منابع مشابه
Minmax regret 1-center problem on a network with a discrete set of scenarios
We consider the minmax regret 1-center problem on a general network with uncertainty on demands. Unlike other papers which considered the problem under interval uncertainty, we assume here that demand uncertainty is modelled by a finite number of discrete scenarios. We develop a solution approach based on the decomposition of the network into basic intervals and present a polynomial algorithm f...
متن کاملHeuristic algorithms for the minmax regret flow-shop problem with interval processing times
An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations ...
متن کاملRandomized Minmax Regret for Combinatorial Optimization Under Uncertainty
The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs with the intention of maximizing the regret of the player. Existing minmax regret models consider only deterministic solutions/strategies, and minmax regret...
متن کاملMinmax regret solutions for minimax optimization problems with uncertainty
We propose a general approach for nding minmax regret solutions for a class of combinatorial optimization problems with an objective function of minimax type and uncertain objective function coe cients. The approach is based on reducing a problem with uncertainty to a number of problems without uncertainty. The method is illustrated on bottleneck combinatorial optimization problems, minimax mul...
متن کاملA Probabilistic Model for Minmax Regret in Combinatorial Optimization
In this paper, we propose a probabilistic model for minimizing the anticipated regret in combinatorial optimization problems with distributional uncertainty in the objective coefficients. The interval uncertainty representation of data is supplemented with information on the marginal distributions. As a decision criterion, we minimize the worst-case conditional value-at-risk of regret. The prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.10.022